Generalizations of the clustering coefficient to weighted complex networks.

نویسندگان

  • Jari Saramäki
  • Mikko Kivelä
  • Jukka-Pekka Onnela
  • Kimmo Kaski
  • János Kertész
چکیده

The recent high level of interest in weighted complex networks gives rise to a need to develop new measures and to generalize existing ones to take the weights of links into account. Here we focus on various generalizations of the clustering coefficient, which is one of the central characteristics in the complex network theory. We present a comparative study of the several suggestions introduced in the literature, and point out their advantages and limitations. The concepts are illustrated by simple examples as well as by empirical data of the world trade and weighted coauthorship networks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continuous and robust clustering coefficients for weighted and directed networks

We introduce new clustering coefficients for weighted networks. They are continuous and robust against edge weight changes. Recently, generalized clustering coefficients for weighted and directed networks have been proposed. These generalizations have a common property, that their values are not continuous. They are sensitive with edge weight changes, especially at zero weight. With these gener...

متن کامل

Directed clustering in weighted networks: a new perspective

In this paper, we consider the problem of assessing local clustering in complex networks. Various definitions for this measure have been proposed for the cases of networks having weighted edges, but less attention has been paid to both weighted and directed networks. We provide a new local clustering coefficient for this kind of networks, starting from those existing in the literature for the w...

متن کامل

Statistical Analysis of Weighted Networks

The purpose of this paper is to assess the statistical characterization of weighted networks in terms of the generalization of the relevant parameters, namely, average path length, degree distribution, and clustering coefficient. Although the degree distribution and the average path length admit straightforward generalizations, for the clustering coefficient several different definitions have b...

متن کامل

Characterizing Motifs in Weighted Complex Networks

The local structure of unweighted complex networks can be characterized by the occurrence frequencies of subgraphs in the network. Frequently occurring subgraphs, motifs, have been related to the functionality of many natural and man-made networks. Here, we generalize this approach for weighted networks, presenting two novel measures: the intensity of a subgraph, defined as the geometric mean o...

متن کامل

A New Methodology for Generalizing Unweighted Network Measures

Several important complex network measures that helped discovering common patterns across real-world networks ignore edge weights, an important information in real-world networks. We propose a new methodology for generalizing measures of unweighted networks through a generalization of the cardinality concept of a set of weights. The key observation here is that many measures of unweighted netwo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Physical review. E, Statistical, nonlinear, and soft matter physics

دوره 75 2 Pt 2  شماره 

صفحات  -

تاریخ انتشار 2007